package LeetCode._02算法基础.day07广度深度优先搜索;

/**
 * @author 挚爱之夕
 * @date 2022 - 03 - 17 - 15:45
 * @Description 树节点
 * @Version 1.0
 */
public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode() {
    }

    TreeNode(int val) {
        this.val = val;
    }

    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}